The connecting of things to the Internet makes it possible for smart things to access all kinds of Web services. However, smart\nthings are energy-limited, and suitable selection of Web services will consume less resources. In this paper, we study the problem\nof selecting someWeb service from the candidate set.We formulate this selection ofWeb services for smart things as single-source\nmany-target shortest path problem. We design algorithms based on the Dijkstra and breadth-first search algorithms, propose an\nefficient pruning algorithm for breadth-first search, and analyze their performance of number of iterations and I/O cost. Our\nempirical evaluation on real-life graphs shows that our pruning algorithm is more efficient than the breadth-first search algorithm.
Loading....